pushout diagram

См. также в других словарях:

• Pushout (category theory) — In category theory, a branch of mathematics, a pushout (also called a fibered coproduct or fibered sum or cocartesian square or amalgamed sum) is the colimit of a diagram consisting of two morphisms f : Z → X and g : Z → Y with a common …   Wikipedia

• Diagram (category theory) — In category theory, a branch of mathematics, a diagram is the categorical analogue of an indexed family in set theory. The primary difference is that in the categorical setting one has morphisms. An indexed family of sets is a collection of sets …   Wikipedia

• Graph rewriting — In graph theory, graph rewriting is a system of rewriting for graphs, i.e. a set of graph rewrite rules of the form p: L ightarrow R, with L being called pattern graph (or left hand side) and R being called replacement graph (or right hand side… …   Wikipedia

• Span (category theory) — A span, in category theory, is a generalization of the notion of relation between two objects of a category. When the category has all pullbacks (and satisfies a small number of other conditions), spans can be considered as morphisms in a… …   Wikipedia

• Seifert–van Kampen theorem — In mathematics, the Seifert–van Kampen theorem of algebraic topology, sometimes just called van Kampen s theorem, expresses the structure of the fundamental group of a topological space X, in terms of the fundamental groups of two open, path… …   Wikipedia

• Pullback (category theory) — In category theory, a branch of mathematics, a pullback (also called a fibered product or Cartesian square) is the limit of a diagram consisting of two morphisms f : X → Z and g : Y → Z with a common codomain. The pullback is often written: P = X …   Wikipedia

• Mapping cylinder — In mathematics, specifically algebraic topology, the mapping cylinder of a function f between topological spaces X and Y is the quotient where the union is disjoint, and ∼ is the equivalence relation That is, the mapping cylinder Mf …   Wikipedia

• Denotational semantics — In computer science, denotational semantics (initially known as mathematical semantics or Scott–Strachey semantics) is an approach to formalizing the meanings of programming languages by constructing mathematical objects (called denotations)… …   Wikipedia

• Adjunction space — In mathematics, an adjunction space is a common construction in topology where one topological space is attached or glued onto another. Specifically, let X and Y be a topological spaces with A a subspace of Y . Let f : A → X be a continuous map… …   Wikipedia

• Universal property — In various branches of mathematics, certain constructions are frequently defined or characterised by an abstract property which requires the existence of a unique morphism under certain conditions. These properties are called universal properties …   Wikipedia

• List of mathematics articles (P) — NOTOC P P = NP problem P adic analysis P adic number P adic order P compact group P group P² irreducible P Laplacian P matrix P rep P value P vector P y method Pacific Journal of Mathematics Package merge algorithm Packed storage matrix Packing… …   Wikipedia